Tensorial Properties of Multiple View Constraints

نویسنده

  • Anders Heyden
چکیده

We define and derive some properties of the different multiple view tensors. The multiple view geometry is described using a four-dimensional linear manifold in IR3m, wherem denotes the number of images. The Grassman coordinates of this manifold build up the components of the different multiple view tensors. All relations between these Grassman coordinates can be expressed using the quadratic p-relations. From this formalism it is evident that the multiple view geometry is described by four different kinds of projective invariants; the epipoles, the fundamental matrices, the trifocal tensors and the quadrifocal tensors. We derive all constraint equations on these tensors that can be used to estimate them from corresponding points and/or lines in the images as well as all transfer equations that can be used to transfer features seen in some images to another image. As an application of this formalism we show how a representation of the multiple view geometry can be calculated from different combination of multiple view tensors and how some tensors can be extracted from others. We also give necessary and sufficient conditions for the tensor components, i.e. the constraints they have to obey in order to build up a correct tensor, as well as for arbitrary combinations of tensors. Finally, the tensorial rank of the different multiple view tensors are considered and calculated. MOS subject classification: Primary: 15 A 72; Secondary: 51 N 15, 68 XX (Computer Vision)

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Correlation functions of main-chain polymer nematics constrained by tensorial and vectorial conservation laws.

We present and analyze correlation functions of a main-chain polymer nematic in a continuum worm-like chain description for two types of constraints formalized by the tensorial and vectorial conservation laws, both originating in the microscopic chain integrity, i.e., the connectivity of the polymer chains. In particular, our aim is to identify the features of the correlation functions that are...

متن کامل

Superfield Theories in Tensorial Superspaces and the Dynamics of Higher Spin Fields

We present the superfield generalization of free higher spin equations in tensorial superspaces and analyze tensorial supergravity as a possible framework for the construction of a non–linear higher spin field theory. Surprisingly enough, we find that the most general solution of the supergravity constraints is given by a class of superconformally flat and OSp(1|n)–related geometries. Because o...

متن کامل

Solving product mix problem in multiple constraints environment using goal programming

The theory of constraints is an approach to production planning and control that emphasizes on the constraints to increase throughput by effectively managing constraint resources. One application in theory of constraints is product mix decision. Product mix influences the performance measures in multi-product manufacturing system. This paper presents an alternative approach by using of goal pro...

متن کامل

Tensorial conservation law for nematic polymers.

We derive the "conservation law" for nematic polymers in tensorial form valid for quadrupolar orientational order, in contradistinction to the conservation law in the case of polar orientational order. Due to microscopic differences in the coupling between the orientational field deformations and the density variations for polar and quadrupolar order, we find that the respective order parameter...

متن کامل

An easy way to include weak alignment constraints into NMR structure calculations.

We have recently shown that an energy penalty for the incorporation of residual tensorial constraints into molecular structure calculations can be formulated without the explicit knowledge of the Saupe orientation tensor (Moltke and Grzesiek. J. Biomol. NMR, 1999, 15, 77-82). Here we report the implementation of such an algorithm into the program X-PLOR. The new algorithm is easy to use and has...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2007